Approximating the online set multicover problems via randomized winnowing
نویسندگان
چکیده
منابع مشابه
Approximating the Online Set Multicover Problems via Randomized Winnowing
In this paper, we consider the weighted online set k-multicover problem. In this problem, we have a universe V of elements, a family S of subsets of V with a positive real cost for every S ∈ S, and a “coverage factor” (positive integer) k. A subset {i0, i1, . . .} ⊆ V of elements are presented online in an arbitrary order. When each element ip is presented, we are also told the collection of al...
متن کاملExact Algorithms for Set Multicover and Multiset Multicover Problems
Given a universe N containing n elements and a collection of multisets or sets over N , the multiset multicover (MSMC) or the set multicover (SMC) problem is to cover all elements at least a number of times as specified in their coverage requirements with the minimum number of multisets or sets. In this paper, we give various exact algorithms for these two problems, with or without constraints ...
متن کاملDynamic programming based algorithms for set multicover and multiset multicover problems
Given a universe N containing n elements and a collection of multisets or sets over N , the multiset multicover (MSMC) problem or the set multicover (SMC) problem is to cover all elements at least a number of times as specified in their coverage requirements with the minimum number of multisets or sets. In this paper, we give various exact algorithms for these two problems with or without const...
متن کاملRandomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as follows: • We abstract a combinatorial version of the problem and observe that this is “equivalent” to the set multicover problem when the “coverage” factor k is a function of the number of elements n of the universe. ...
متن کاملApproximating Directed Steiner Problems via Tree Embedding
Directed Steiner problems are fundamental problems in Combinatorial Optimization and Theoretical Computer Science. An important problem in this genre is the k-edge connected directed Steiner tree (k-DST) problem. In this problem, we are given a directed graph G on n vertices with edge-costs, a root vertex r, a set of h terminals T and an integer k. The goal is to find a min-cost subgraph H ⊆ G ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.10.047